package 二叉树;

/**
 * https://leetcode-cn.com/problems/minimum-distance-between-bst-nodes/
 */
public class 二叉搜索树节点最小距离 {
    public int minDiffInBST(TreeNode root) {
        return 0;
    }
}
